2 research outputs found

    Wavelet analysis of non-stationary signals with applications

    Get PDF
    The empirical mode decomposition (EMD) algorithm, introduced by N.E. Huang et al in 1998, is arguably the most popular mathematical scheme for non-stationary signal decomposition and analysis. The objective of EMD is to separate a given signal into a number of components, called intrinsic mode functions (IMF\u27s), after which the instantaneous frequency (IF) and amplitude of each IMF are computed through Hilbert spectral analysis (HSA). On the other hand, the synchrosqueezed wavelet transform (SST), introduced by I. Daubechies and S. Maes in 1996 and further developed by I. Daubechies, J. Lu and H.-T. Wu in 2011, is first applied to estimate the IF\u27s of all signal components of the given signal, based on one single frequency reassignment rule, under the assumption that the signal components satisfy certain strict properties of the so-called adaptive harmonic model, before the signal components of the model are recovered, based on the estimated IF\u27s. The objective of this dissertation is to develop a hybrid EMD-SST computational scheme by applying a modified SST to each IMF produced by a modified EMD, as an alternative approach to the original EMD-HSA method. While our modified SST assures non-negative instantaneous frequencies of the IMF\u27s, application of the EMD scheme eliminates the dependence on a single frequency reassignment rule as well as the guessing work of the number of signal components in the original SST approach. Our modification of the SST consists of applying analytic vanishing moment wavelets (introduced in a recent paper by C.K. Chui, Y.-T. Lin and H.-T. Wu) with stacked knots to process signals on bounded or half-infinite time intervals, and spline curve fitting with optimal smoothing parameter selection through generalized cross-validation. In addition, we modify EMD by formulating a local spline interpolation scheme for bounded intervals, for real-time realization of the EMD sifting process. This scheme improves over the standard global cubic spline interpolation, both in quality and computational cost, particularly when applied to bounded and half-infinite time intervals

    Ternary interpolatory subdivision

    Get PDF
    Thesis (MSc)--Stellenbosch University, 2012.ENGLISH ABSTRACT: Subdivision is an important and e cient tool for rendering smooth curves and surfaces in computer graphics, by repeatedly applying a subdivision (re ning) scheme to a given set of points. In the literature, attention has been mostly restricted to developing binary subdivision schemes. The primary emphasis of this thesis is on ternary subdivision, and in particular on the interpolatory case. We will derive a symmetric ternary interpolatory subdivision scheme for the rendering of curves, satisfying analogous properties to the Dubuc-Deslauriers binary scheme. Explicit construction methods, as well as a corresponding convergence analysis, will be presented. Graphical illustrations of the results will also be provided.AFRIKAANSE OPSOMMING: Subdivisie bied 'n belangrike en doeltre ende metode om gladde krommes en oppervlakke in rekenaargra ka te genereer. Hierdie metode behels dat 'n subdivisieskema (of verfyningskema) herhaaldelik toegepas word op 'n gegewe versameling punte. In die literatuur word daar hoofsaaklik gefokus op die ont- wikkeling van bin^ere subdivisieskemas. In hierdie tesis word die klem gel^e op tern^ere subdivisieskemas, en in die besonder op interpolerende skemas. Ons sal 'n simmetriese tern^ere interpolerende subdivisieskema, wat analo e eienskappe as di e van die Dubuc-Deslauriers bin^ere skema bevredig, ontwikkel, om krom- mes te lewer. Eksplisiete konstruksiemetodes en ooreenkomstige konvergensie- analise, asook gra ese illustrasies van die resultate, sal getoon word
    corecore